Convergence of multigrid algorithms incorporating an artificial damping
نویسندگان
چکیده
منابع مشابه
Convergence of Multigrid Algorithms Incorporating an Artificial Damping
When the solution and coefficients in a problem are highly oscillatory, there exists sometimes a glaring difference between solution and physical results. This occurrence can be arisen by the fact that the coarse grid problem is still huge and poorly-conditioned. In this case, one way for solving such problems is to apply an artificial damping in multigrid algorithm. In [9], a multigrid algorit...
متن کاملArtificial damping in multigrid methods
When the solution and problem coeecients are highly oscillatory, the computed solution may not show characteristics of the original physical problem unless the numerical mesh is suuciently ne. In the case, the coarse grid problem of a multigrid (MG) algorithm must be still huge and poorly-conditioned, and therefore, it is hard to solve by either a direct method or an iterative scheme. This arti...
متن کاملNew Convergence Estimates for Multigrid Algorithms
In this paper, new convergence estimates are proved for both symmetric and nonsymmetric multigrid algorithms applied to symmetric positive definite problems. Our theory relates the convergence of multigrid algorithms to a "regularity and approximation" parameter a 6 (0,1] and the number of relaxations m. We show that for the symmetric and nonsymmetric V cycles, the multigrid iteration converges...
متن کاملEffect of Artificial Diffusion Schemes on Multigrid Convergence
The effect of artificial diffusion schemes on the convergence of an implicit method is investigated. A multigrid code using a symmetric limited positive scheme in conjunction with a lowerupper symmetric-Gauss-Seidel method is developed for viscous compressible flows. The present numerical method is shown to be an effective multigrid driver in three-dimensions. Despite its reasonably fast conver...
متن کاملConvergence Estimates for Multigrid Algorithms without Regularity Assumptions
A new technique for proving rate of convergence estimates of multigrid algorithms for symmetric positive definite problems will be given in this paper. The standard multigrid theory requires a "regularity and approximation" assumption. In contrast, the new theory requires only an easily verified approximation assumption. This leads to convergence results for multigrid refinement applications, p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Mathematical Forum
سال: 2007
ISSN: 1314-7536
DOI: 10.12988/imf.2007.07314